Reambiguating: on thenon-monotonicity of disambiguation
نویسندگان
چکیده
The relation between lexical ambiguity and disambiguation ismostly approached from an intra-sentential perspective. Thus, when analyzing the ambiguity and disambiguation of a lexical item, one tends to study its variance in interpretation when it is modified by or occurs as an argument of other lexical items. Broadening this perspective, this paper shows that there are important insights into the nature of disambiguation to be gained by studying more closely how ambiguous expressions behave in contexts spanningmore than one sentence. More specifically, we introduce new data involving anaphora resolution with the following two characteristics: (i) a potentially ambiguous antecedent which is disambiguated in its local context, and (ii) anaphora which refer to one of the possible readings of the antecedent which was not selected in the local antecedent context. We argue that these data call for a revision of how we conceive of and formalize the process of disambiguation, introducing the notion of reambiguation, which characterizes the process of reintroducing alternative interpretations which were originally excluded by disambiguation. The paper is structured as follows. In Section 2, we discuss properties of ambiguity and disambiguation. We also give an informal overview of our approach, including a discussionof the notionof reambiguation. In Section 3, the formal basis of our analysis is presented. In Section 4, we present the analysis and discuss some consequences of our approach for formal discourse semantics in general. Section 5 concludes the paper.
منابع مشابه
Sensor information monotonicity in disambiguation protocols
Previous work has considered the problem of swiftly traversing a marked traversal-medium where the marks represent probabilities that associated local regions are traversable, further supposing that the traverser is equipped with a dynamic capability to disambiguate these regions en route. In practice, however, the marks are given by a noisy sensor, and are only estimates of the respective prob...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملبررسی نقش انواع بافتار همنویسهها در تعیین شباهت بین مدارک
Aim: Automatic information retrieval is based on the assumption that texts contain content or structural elements that can be used in word sense disambiguation and thereby improving the effectiveness of the results retrieved. Homographs are among the words requiring sense disambiguation. Depending on their roles and positions in texts, homograph contexts could be divided to different types, wit...
متن کاملEMCSO: An Elitist Multi-Objective Cat Swarm Optimization
This paper introduces a novel multi-objective evolutionary algorithm based on cat swarm optimizationalgorithm (EMCSO) and its application to solve a multi-objective knapsack problem. The multi-objective optimizers try to find the closest solutions to true Pareto front (POF) where it will be achieved by finding the less-crowded non-dominated solutions. The proposed method applies cat swarm optim...
متن کاملSum Formula for Maximal Abstract Monotonicity and Abstract Rockafellar’s Surjectivity Theorem
In this paper, we present an example in which the sum of two maximal abstract monotone operators is maximal. Also, we shall show that the necessary condition for Rockafellar’s surjectivity which was obtained in ([19], Theorem 4.3) can be sufficient.
متن کامل